Method and system for constraining tile processing overhead in video coding

ABSTRACT

A method for encoding a picture of a video sequence in a bit stream that constrains tile processing overhead is provided. The method includes computing a maximum tile rate for the video sequence, computing a maximum number of tiles for the picture based on the maximum tile rate, and encoding the picture wherein a number of tiles used to encode the picture is enforced to be no more than the maximum number of tiles.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.17/824,554, filed May 25, 2022, currently pending and scheduled to grantas U.S. Pat. No. 11,716,472 on Aug. 1, 2023, which is a continuation ofU.S. patent application Ser. No. 17/386,603, filed Jul. 28, 2021 (nowU.S. Pat. No. 11,375,190), which is a continuation of U.S. patentapplication Ser. No. 17/027,582, filed Sep. 21, 2020 (now U.S. Pat. No.11,202,071), which is a continuation of U.S. patent application Ser. No.14/013,296, filed Aug. 29, 2013 (now U.S. Pat. No. 10,785,482), whichclaims benefit of U.S. Provisional Patent Application Ser. No.61/704,653, filed Sep. 24, 2012, all of above-mentioned applicationsbeing incorporated herein by reference in their entirety.

BACKGROUND OF THE INVENTION Field of the Invention

Embodiments of the present invention generally relate to constrainingtile processing overhead in video coding.

Description of the Related Art

The Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T WP3/16and ISO/IEC JTC 1/SC 29/WG 11 is currently developing thenext-generation video coding standard referred to as High EfficiencyVideo Coding (HEVC). Similar to previous video coding standards such asH.264/AVC, HEVC is based on a hybrid coding scheme using block-basedprediction and transform coding. First, the input signal is split intorectangular blocks that are predicted from the previously decoded databy either motion compensated (inter) prediction or intra prediction. Theresulting prediction error is coded by applying block transforms basedon an integer approximation of the discrete cosine transform, which isfollowed by quantization and coding of the transform coefficients.

In HEVC, a largest coding unit (LCU) is the base unit used forblock-based coding. A picture is divided into non-overlapping LCUs. Thatis, an LCU plays a similar role in coding as the macroblock ofH.264/AVC, but it may be larger, e.g., 32×32, 64×64, etc. An LCU may bepartitioned into coding units (CU). A CU is a block of pixels within anLCU and the CUs within an LCU may be of different sizes. Thepartitioning is a recursive quadtree partitioning. The quadtree is splitaccording to various criteria until a leaf is reached, which is referredto as the coding node or coding unit. The maximum hierarchical depth ofthe quadtree is determined by the size of the smallest CU (SCU)permitted. The coding node is the root node of two trees, a predictiontree and a transform tree. A prediction tree specifies the position andsize of prediction units (PU) for a coding unit. A transform treespecifies the position and size of transform units (TU) for a codingunit. A transform unit may not be larger than a coding unit and the sizeof a transform unit may be, for example, 4×4, 8×8, 16×16, and 32×32. Thesizes of the transform units and prediction units for a CU aredetermined by the video encoder during prediction based on minimizationof rate/distortion costs.

To support efficient implementation on multi-code platforms, severalparallel processing tools have been adopted into HEVC. One of thesetools is tiling. Tiling enables a picture to be partitioned into groupsof LCUs referred to as tiles that may independently processed. Theprocessing overhead in a decoder associated with tiles includes theprocessing for transitioning from one tile to the next. During thetransition, a decoder needs to perform processing to, for example, resetCABAC and store the samples, motion data and inter-prediction and/orintra-prediction flags from neighboring tiles for loop filtering alongtile boundaries. Such processing for a large number of tiles may make itdifficult to perform real-time decoding. Accordingly, constraining thetile processing overhead is desirable.

SUMMARY

Embodiments of the present invention relate to methods, apparatus, andcomputer readable media that constrain tile processing overhead ascompared to the prior art. In one aspect, a method for encoding apicture of a video sequence in a bit stream is provided that includescomputing a maximum tile rate for the video sequence, computing amaximum number of tiles for the picture based on the maximum tile rate,and encoding the picture wherein a number of tiles used to encode thepicture is enforced to be no more than the maximum number of tiles.

In one aspect, a method for encoding a picture of a video sequence in abit stream is provided that includes determining a level for the videosequence, computing a maximum tile rate for the video sequence asMaxLumaSR/MaxLumaPS*MaxTileCols*MaxTileRows, wherein MaxLumaSR is amaximum luma sample rate specified for the level, MaxLumaPS is a maximumluma picture size in samples specified for the level, MaxTileCols is amaximum number of tile columns per picture specified for the level, andMaxTileRows is a maximum number of tile rows per picture specified forthe level, computing a maximum number of tiles for the picture as aminimum of MaxTileCols*MaxTileRows and the maximum tile rate divided bya frame rate of the video sequence when the frame rate is fixed,computing a maximum number of tiles for the picture as a minimum ofMaxTileCols*MaxTileRows and the maximum tile rate multiplied by adifference in display time between the picture and a picture immediatelypreceding the picture in display order when the frame rate is variable,and encoding the picture wherein a number of tiles used to encode thepicture is constrained to be no more than the maximum number of tiles.

In one aspect, an apparatus configured to encode a picture of a videosequence in a bit stream is provided that includes means for computing amaximum tile rate for the video sequence, means for computing a maximumnumber of tiles for the picture based on the maximum tile rate, andmeans for encoding the picture wherein a number of tiles used to encodethe picture is enforced to be no more than the maximum number of tiles.

BRIEF DESCRIPTION OF THE DRAWINGS

Particular embodiments will now be described, by way of example only,and with reference to the accompanying drawings:

FIG. 1 is an example illustrating partitioning of a picture into tiles;

FIG. 2 is an example level table for a profile;

FIG. 3 is a block diagram of a digital system;

FIGS. 4A and 4B are a block diagram of an example video encoder;

FIG. 5 is a block diagram of an example video decoder;

FIGS. 6 and 7 are flow diagrams of methods;

FIG. 8 is an example variable frame rate sequence; and

FIG. 9 is a block diagram of an illustrative digital system.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Specific embodiments of the invention will now be described in detailwith reference to the accompanying figures. Like elements in the variousfigures are denoted by like reference numerals for consistency.

As used herein, the term “picture” may refer to a frame or a field of aframe. A frame is a complete image captured during a known timeinterval. For convenience of description, embodiments are describedherein in reference to HEVC. One of ordinary skill in the art willunderstand that embodiments of the invention are not limited to HEVC.

Various versions of HEVC are described in the following documents, whichare incorporated by reference herein: T. Wiegand, et al., “WD3: WorkingDraft 3 of High-Efficiency Video Coding,” JCTVC-E603, JointCollaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 andISO/IEC JTC1/SC29/WG11, Geneva, CH, Mar. 16-23, 2011 (“WD3”), B. Bross,et al., “WD4: Working Draft 4 of High-Efficiency Video Coding,”JCTVC-F803_d6, Joint Collaborative Team on Video Coding (JCT-VC) ofITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Torino, IT, Jul. 14-22, 2011(“WD4”), B. Bross. et al., “WD5: Working Draft 5 of High-EfficiencyVideo Coding,” JCTVC-G1103_d9, Joint Collaborative Team on Video Coding(JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Geneva, CH, Nov.21-30, 2011 (“WD5”), B. Bross, et al., “High Efficiency Video Coding(HEVC) Text Specification Draft 6,” JCTVC-H1003_dK, Joint CollaborativeTeam on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IECJTC1/SC29/WG1, San Jose, California, Feb. 1-10, 2012, (“HEVC Draft 6”),B. Bross, et al., “High Efficiency Video Coding (HEVC) TextSpecification Draft 7,” JCTVC-I1003_d9, Joint Collaborative Team onVideo Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG1,Geneva, CH, Apr. 17-May 7, 2012 (“HEVC Draft 7”), B. Bross, et al.,“High Efficiency Video Coding (HEVC) Text Specification Draft 8,”JCTVC-J1003_d7, Joint Collaborative Team on Video Coding (JCT-VC) ofITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG1, Stockholm, SE, Jul. 11-20,2012 (“HEVC Draft 8”), B. Bross, et al., “High Efficiency Video Coding(HEVC) Text Specification Draft 9,” JCTVC-K1003_v13, Joint CollaborativeTeam on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IECJTC1/SC29/WG1, Shanghai, CN, Oct. 10-19, 2012 (“HEVC Draft 9”), and B.Bross, et al., “High Efficiency Video Coding (HEVC) Text SpecificationDraft 10 (for FDIS & Last Call),” JCTVC-L1003_v34, Joint CollaborativeTeam on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IECJTC1/SC29/WG1, Geneva, CH, Jan. 14-23, 2013 (“HEVC Draft 10”).

Some aspects of this disclosure have been presented to the JCT-VC in M.Zhou, “AHG9: On Number of Tiles Constraint,” JCTVC-K0202, JointCollaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 andISO/IEC JTC1/SC29/WG1, Shanghai, China, Oct. 10-19, 2012, which isincorporated by reference herein in its entirety.

As previously mentioned, constraining the overhead of processing tilesis desirable. FIG. 1 shows an example of a picture partitioned into sixtiles. A tile includes an integer number of LCUs and each tile isrequired to be independently decodable, i.e., all parts of the decodingprocess are independent from tile to tile except for in-loop filters(e.g., de-blocking and sample adaptive offset filtering). The LCUs of atile are coded in raster scanning order, and the tiles of a picture arecoded in raster scan order. Within a picture, tiles of the picture arecoded in raster scanning order.

As previously mentioned, there is processing overhead associated with atile. During the tile transitions, a decoder needs to, for example,reset CABAC, and store the samples and prediction data from neighboringtiles for loop-filtering along tile boundaries. To enable real-timedecoding, it is important to constrain the worst case number of tilesallowed for pictures.

In the prior art HEVC specification, HEVC Draft 8, the tile processingoverhead issue is addressed by restricting the maximum number of tilesin pictures in bit streams in levels of profiles. In HEVC (and othervideo coding standards), a profile specifies a set of coding tools thatare supported by the profile, and a level specifies parameterconstraints such as maximum sample rate, maximum bit-rate, maximumpicture size, etc. To conform to a particular profile and level, thepictures in a bit stream must have no more tiles than a maximum numberderived from the level parameters. More specifically, the number of tilecolumns minus 1 (num_tile_columns_minus1) in each picture is required tobe less than a maximum number of tile columns referred to as MaxTileColsand the number of tile rows minus 1 (num_tile_rows_minus1) is requiredto be less than a maximum number of tile rows referred to asMaxTileRows. Thus, the total number of tiles of a picture, which can beexpressed as (num_tile_columns_minus1+1) multiplied by(num_tile_rows_minus1+1) is required to be less than or equal toMaxTileCols multiplied by MaxTileRows. The values of MaxTileCols andMaxTileRows are level dependent and are specified in Table A-1 of HEVCDraft 8. This table is replicated in FIG. 2 . In addition, HEVC alsorequires that the minimum tile size must be greater than or equal to256×64 luma samples.

For any given level, a complaint decoder may need to support real-timedecoding of video bit streams with different frame-rates and/or picturesizes. For example, level 5 in the table of FIG. 2 supports 4K×2K@30(4K×2K pictures at 30 frames per second) and the maximum number of tilesper second is 3300 tiles/sec, i.e., 30 frames/sec multiplied by 11*10tiles/frame). For the same maximum sample rate constraint of level 5, alevel 5 compliant decoder also needs to be able to decode video bitstreams at, for example, 1080p@120 and 720p@240, in real-time. Becauseonly the maximum number of tiles per picture is fixed (11*10 per picturein this case), the worst case number of tiles per second increases to13200 tiles/sec, i.e., 120 frames/sec multiplied by 110 tiles/frame and13500 tiles/sec, i.e., 240 frames/sec multiplied by (1280*720)/(256*64),as it is limited by the minimum tile size of 256×64 for 1080p@120 and720p@240, respectively. Thus, the worst case tile processing overheadcan vary for a level based on the frame rate of the incoming compressedvideo bit stream, which imposes an unacceptable burden in the design ofa real-time decoder which is required to deal with worst cases.Therefore, merely limiting the maximum number of tiles per picture as inthe prior art and specifying a minimum tile size of 256×64 is notsufficient for constraining tile processing overhead, because theoverhead increases proportionally to the frame-rate of a coded videosequence.

Embodiments of the invention provide for constraining the worst casenumber of tiles per second rate to be constant for a level. The worstcase number of tiles per second rate, i.e., the maximum tile rate(MaxTileRate), for a level may be defined as

MaxTileRate=MaxLumaSR/MaxLumaPS*MaxTileCols*MaxTileRows

where MaxLumaSR is the maximum luma sample rate, MaxLumaPS is themaximum luma picture size in samples, MaxTileCols is the maximum numberof tile columns, and MaxTileRows is the maximum number of tile rows.Example values of MaxLumaSR, MaxLumaPS, MaxTileCols, and MaxTileRows foreach level are shown in the example level table of FIG. 2 . One ofordinary skill in the art will understand embodiments in which othersuitable values are used and/or in which more or fewer levels arespecified for a profile. One of ordinary skill in the art will alsounderstand that the parameters used to compute the maximum tile rate maydiffer depending upon the particular parameters defined for levels.

FIG. 3 shows a block diagram of a digital system that includes a sourcedigital system 300 that transmits encoded video sequences to adestination digital system 302 via a communication channel 316. Thesource digital system 300 includes a video capture component 304, avideo encoder component 306, and a transmitter component 308. The videocapture component 304 is configured to provide a video sequence to beencoded by the video encoder component 306. The video capture component304 may be, for example, a video camera, a video archive, or a videofeed from a video content provider. In some embodiments, the videocapture component 304 may generate computer graphics as the videosequence, or a combination of live video, archived video, and/orcomputer-generated video.

The video encoder component 306 receives a video sequence from the videocapture component 304 and encodes it for transmission by the transmittercomponent 308. The video encoder component 306 receives the videosequence from the video capture component 304 as a sequence of pictures,divides the pictures into largest coding units (LCUs), and encodes thevideo data in the LCUs. The video encoder component 306 may beconfigured to comply with a worst case number of tiles per second rateduring the encoding process as described herein. An embodiment of thevideo encoder component 306 is described in more detail herein inreference to FIGS. 4A and 4B.

The transmitter component 308 transmits the encoded video data to thedestination digital system 302 via the communication channel 316. Thecommunication channel 316 may be any communication medium, orcombination of communication media suitable for transmission of theencoded video sequence, such as, for example, wired or wirelesscommunication media, a local area network, or a wide area network.

The destination digital system 302 includes a receiver component 310, avideo decoder component 312 and a display component 314. The receivercomponent 310 receives the encoded video data from the source digitalsystem 300 via the communication channel 316 and provides the encodedvideo data to the video decoder component 312 for decoding. The videodecoder component 312 reverses the encoding process performed by thevideo encoder component 306 to reconstruct the LCUs of the videosequence. The video decoder component 312 may be configured to confirmcompliance with a worst case number of tiles per second rate during thedecoding process as described herein. An embodiment of the video decodercomponent 312 is described in more detail below in reference to FIG. 5 .

The reconstructed video sequence is displayed on the display component314. The display component 314 may be any suitable display device suchas, for example, a plasma display, a liquid crystal display (LCD), alight emitting diode (LED) display, etc.

In some embodiments, the source digital system 300 may also include areceiver component and a video decoder component and/or the destinationdigital system 302 may include a transmitter component and a videoencoder component for transmission of video sequences both directionsfor video streaming, video broadcasting, and video telephony. Further,the video encoder component 306 and the video decoder component 312 mayperform encoding and decoding in accordance with one or more videocompression standards. The video encoder component 306 and the videodecoder component 312 may be implemented in any suitable combination ofsoftware, firmware, and hardware, such as, for example, one or moredigital signal processors (DSPs), microprocessors, discrete logic,application specific integrated circuits (ASICs), field-programmablegate arrays (FPGAs), etc.

FIGS. 4A and 4B show block diagrams of an example video encoderconfigured to constrain the tile rate per picture during the encodingprocess to be less than or equal to a worst case number of tiles persecond rate. FIG. 4A shows a high level block diagram of the videoencoder and FIG. 4B shows a block diagram of the LCU processingcomponent 642 of the video encoder. As shown in FIG. 4A, the videoencoder includes a coding control component 440, an LCU processingcomponent 442, and a memory 446. The memory 446 may be internal(on-chip) memory, external (off-chip) memory, or a combination thereof.The memory 446 may be used to communicate information between thevarious components of the video encoder.

An input digital video sequence is provided to the coding controlcomponent 440. The coding control component 440 sequences the variousoperations of the video encoder, i.e., the coding control component 440runs the main control loop for video encoding. For example, the codingcontrol component 440 performs processing on the input video sequencethat is to be done at the picture level, such as determining the codingtype (I, P, or B) of a picture based on a high level coding structure,e.g., IPPP, IBBP, hierarchical-B, and dividing a picture into LCUs forfurther processing.

In addition, for pipelined architectures in which multiple LCUs may beprocessed concurrently in different components of the LCU processing,the coding control component 440 controls the processing of the LCUs byvarious components of the LCU processing in a pipeline fashion. Forexample, in many embedded systems supporting video processing, there maybe one master processor and one or more slave processing modules, e.g.,hardware accelerators. The master processor operates as the codingcontrol component and runs the main control loop for video encoding, andthe slave processing modules are employed to off load certaincompute-intensive tasks of video encoding such as motion estimation,motion compensation, intra prediction mode estimation, transformationand quantization, entropy coding, and loop filtering. The slaveprocessing modules are controlled in a pipeline fashion by the masterprocessor such that the slave processing modules operate on differentLCUs of a picture at any given time. That is, the slave processingmodules are executed in parallel, each processing its respective LCUwhile data movement from one processor to another is serial.

The coding control component 440 also determines the profile and levelwithin the profile for the video sequence to be encoded. Typically, anencoder is designed for a particular profile. For example, HEVCcurrently defines two profiles: the Main profile for 8-bit video and theMain-10 profile for 8-bit and 10-bit video. If the encoder is designedfor only the Main profile, then the profile of any incoming 8-bit videowill be the Main profile. If the encoder is designed for the Main-10profile, then the profile of an incoming video sequence is set based onthe bit-depth of the video. That is, if the video is 8-bit video, thenthe profile will be the Main profile, and if the video is 10-bit video,then the profile will be the Main-10 profile. Typically, the encoderselects a level from the profile that is the minimum level satisfyingthe picture size, frame rate, bit-rate, etc. of the incoming videosequence as the desired result is to select a level that communicates toa decoder the minimum capability needed to decode the resultingcompressed bit stream.

Once the profile and level are determined, the coding control component440 computes a maximum tile rate (worst case number of tiles per second)for pictures in the video sequence based on parameter values defined forthe level. Computation of the maximum tile rate is previously discussedherein.

The coding control component 440 then constrains the tile rate for eachpicture to be less than or equal to the maximum tile rate. In someembodiments, the coding control component 440 constrains the tile rateby computing a maximum number of tiles for each picture based on themaximum tile rate constraint and then restricting the number of tilesused in encoding of the picture to be less than or equal to the computedmaximum tile number. More specifically, for each fixed frame ratepicture, the coding control component 440 computes the maximum number oftiles for the picture as

min(MaxTileCols*MaxTileRows,MaxTileRate/FrameRate)

where the value of MaxTileRate is the maximum tile rate computed aspreviously described, and min(a, b) returns the minimum value of a andb. As previously mentioned, MaxTileCols and MaxTileRows are,respectively, the maximum number of tile columns and the maximum numberof tile rows in a picture. Note that a picture should contain at leastone tile; thus, the minimum value of the maximum number of tiles in apicture is one.

For each variable frame rate picture, the coding control component 440computes the maximum number of tiles for the picture as

min(MaxTileCols*MaxTileRows,MaxTileRate *(t(n)−t(n−1))

where t(n) is the display time of picture n in display order. For thefirst picture in the sequence (i.e., n=0), the initial display time,i.e, t(−1), can be determined by the initial specified delays. FIG. 8shows an example variable frame rate sequence.

The operation of the coding control component 440 to constrain thenumber of tiles in a picture to be less than or equal to the computedmaximum number of tiles for the picture may be performed in any suitableway and may depend on the application using the video encoder. Forexample, the coding control component 440 may select the number of tiles(where the tiles are approximately equal in size) for a picture to beless than or equal to the computed maximum number of tiles for thepicture and then encode the picture tile by tile in raster scan order.Note that a tile contains an integer number of LCUs. The coding controlcomponent 440 also causes tile-related information indicating the numberof tiles, the tiles sizes, and the tile locations to be encoded in thepicture parameter set for a picture.

FIG. 4B is a block diagram of the LCU processing component 442. The LCUprocessing component 442 receives LCUs 400 of the input video sequencefrom the coding control component and encodes the LCUs 400 under thecontrol of the coding control component 440 to generate the compressedvideo stream. The LCUs 400 in each picture are processed in row order.The LCUs 400 from the coding control component are provided as one inputof a motion estimation component (ME) 420, as one input of anintra-prediction estimation component (IPE) 424, and to a positive inputof a combiner 402 (e.g., adder or subtractor or the like). Further,although not specifically shown, the prediction mode of each picture asselected by the coding control component 440 is provided to a modedecision component 428 and the entropy coding component 436.

The storage component 418 provides reference data to the motionestimation component 420 and to the motion compensation component 422.The reference data may include one or more previously encoded anddecoded pictures, i.e., reference pictures. Both list 0 and list 1reference pictures may be stored by the storage component 418.

The motion estimation component 420 provides motion data information tothe motion compensation component 422 and the entropy coding component436. More specifically, the motion estimation component 420 performstests on CUs in an LCU based on multiple inter-prediction modes (e.g.,skip mode, merge mode, and normal or direct inter-prediction), PU sizes,and TU sizes using reference picture data from storage 418 to choose thebest CU partitioning, PU/TU partitioning, inter-prediction modes, motionvectors, etc. based on coding cost, e.g., a rate distortion coding cost.To perform the tests, the motion estimation component 420 may divide anLCU into CUs according to the maximum hierarchical depth of thequadtree, and divide each CU into PUs according to the unit sizes of theinter-prediction modes and into TUs according to the transform unitsizes, and calculate the coding costs for each PU size, prediction mode,and transform unit size for each CU. The motion estimation component 420provides the motion vector (MV) or vectors and the prediction mode foreach PU in the selected CU partitioning to the motion compensationcomponent (MC) 422.

The motion compensation component 422 receives the selectedinter-prediction mode and mode-related information from the motionestimation component 420 and generates the inter-predicted CUs. Theinter-predicted CUs are provided to the mode decision component 428along with the selected inter-prediction modes for the inter-predictedPUs and corresponding TU sizes for the selected CU/PU/TU partitioning.The coding costs of the inter-predicted CUs are also provided to themode decision component 428.

The intra-prediction estimation component 424 (IPE) performsintra-prediction estimation in which tests on CUs in an LCU based onmultiple intra-prediction modes, PU sizes, and TU sizes are performedusing reconstructed data from previously encoded neighboring CUs storedin a buffer (not shown) to choose the best CU partitioning, PU/TUpartitioning, and intra-prediction modes based on coding cost, e.g., arate distortion coding cost. To perform the tests, the intra-predictionestimation component 424 may divide an LCU into CUs according to themaximum hierarchical depth of the quadtree, and divide each CU into PUsaccording to the unit sizes of the intra-prediction modes and into TUsaccording to the transform unit sizes, and calculate the coding costsfor each PU size, prediction mode, and transform unit size for each PU.The intra-prediction estimation component 424 provides the selectedintra-prediction modes for the PUs and the corresponding TU sizes forthe selected CU partitioning to the intra-prediction component (IP) 426.The coding costs of the intra-predicted CUs are also provided to theintra-prediction component 426.

The intra-prediction component 426 (IP) receives intra-predictioninformation, e.g., the selected mode or modes for the PU(s), the PUsize, etc., from the intra-prediction estimation component 424 andgenerates the intra-predicted CUs. The intra-predicted CUs are providedto the mode decision component 428 along with the selectedintra-prediction modes for the intra-predicted PUs and corresponding TUsizes for the selected CU/PU/TU partitioning. The coding costs of theintra-predicted CUs are also provided to the mode decision component428.

The mode decision component 428 selects between intra-prediction of a CUand inter-prediction of a CU based on the intra-prediction coding costof the CU from the intra-prediction component 426, the inter-predictioncoding cost of the CU from the motion compensation component 422, andthe picture prediction mode provided by the coding control component.Based on the decision as to whether a CU is to be intra- or inter-coded,the intra-predicted PUs or inter-predicted PUs are selected. Theselected CU/PU/TU partitioning with corresponding modes and other moderelated prediction data (if any) such as motion vector(s) and referencepicture index (indices), are provided to the entropy coding component436.

The output of the mode decision component 428, i.e., the predicted PUs,is provided to a negative input of the combiner 402 and to the combiner438. The associated transform unit size is also provided to thetransform component 404. The combiner 402 subtracts a predicted PU fromthe original PU. Each resulting residual PU is a set of pixel differencevalues that quantify differences between pixel values of the original PUand the predicted PU. The residual blocks of all the PUs of a CU form aresidual CU for further processing.

The transform component 404 performs block transforms on the residualCUs to convert the residual pixel values to transform coefficients andprovides the transform coefficients to a quantize component 406. Morespecifically, the transform component 404 receives the transform unitsizes for the residual CU and applies transforms of the specified sizesto the CU to generate transform coefficients. Further, the quantizecomponent 406 quantizes the transform coefficients based on quantizationparameters (QPs) and quantization matrices provided by the codingcontrol component and the transform sizes and provides the quantizedtransform coefficients to the entropy coding component 436 for coding inthe bit stream.

The entropy coding component 436 entropy encodes the relevant data,i.e., syntax elements, output by the various encoding components and thecoding control component using context-adaptive binary arithmetic coding(CABAC) to generate the compressed video bit stream. Among the syntaxelements that are encoded are picture parameter sets, slice headers,flags indicating the CU/PU/TU partitioning of an LCU, the predictionmodes for the CUs, and the quantized transform coefficients for the CUs.The entropy coding component 436 also entropy encodes relevant data fromthe in-loop filters such as the SAO parameters. As previously mentioned,a picture parameter set may include tile-related information indicatingthe number of tiles, the tiles sizes, and the tile locations for apicture.

The LCU processing includes an embedded decoder. As any compliantdecoder is expected to reconstruct an image from a compressed bitstream, the embedded decoder provides the same utility to the videoencoder. Knowledge of the reconstructed input allows the video encoderto transmit the appropriate residual energy to compose subsequentpictures.

The quantized transform coefficients for each CU are provided to aninverse quantize component (IQ) 412, which outputs a reconstructedversion of the transform result from the transform component 404. Thedequantized transform coefficients are provided to the inverse transformcomponent (IDCT) 414, which outputs estimated residual informationrepresenting a reconstructed version of a residual CU. The inversetransform component 414 receives the transform unit size used togenerate the transform coefficients and applies inverse transform(s) ofthe specified size to the transform coefficients to reconstruct theresidual values. The reconstructed residual CU is provided to thecombiner 438.

The combiner 438 adds the original predicted CU to the residual CU togenerate a reconstructed CU, which becomes part of reconstructed picturedata. The reconstructed picture data is stored in a buffer (not shown)for use by the intra-prediction estimation component 424.

Various in-loop filters may be applied to the reconstructed picture datato improve the quality of the reference picture data used forencoding/decoding of subsequent pictures. The in-loop filters mayinclude a deblocking filter 430, a sample adaptive offset filter (SAO)432, and an adaptive loop filter (ALF) 434. The in-loop filters 430,432, 434 are applied to each reconstructed LCU in the picture and thefinal filtered reference picture data is provided to the storagecomponent 418. In some embodiments, the ALF component 434 is notpresent.

FIG. 5 is a block diagram of an example video decoder configured toverify during the decoding process that the tile rates of pictures areconstrained to a maximum tile rate. The video decoder operates toreverse the encoding operations, i.e., entropy coding, quantization,transformation, and prediction, performed by the video encoder of FIGS.4A and 4B to regenerate the pictures of the original video sequence. Inview of the above description of a video encoder, one of ordinary skillin the art will understand the functionality of components of the videodecoder without detailed explanation.

The entropy decoding component 500 receives an entropy encoded(compressed) video bit stream and reverses the entropy encoding usingCABAC decoding to recover the encoded syntax elements, e.g., CU, PU, andTU structures of LCUs, quantized transform coefficients for CUs, motionvectors, prediction modes, weighted prediction parameters, SAOparameters, etc. The decoded syntax elements are passed to the variouscomponents of the decoder as needed. For example, decoded predictionmodes are provided to the intra-prediction component (IP) 514 or motioncompensation component (MC) 510. If the decoded prediction mode is aninter-prediction mode, the entropy decoder 500 reconstructs the motionvector(s) as needed and provides the motion vector(s) to the motioncompensation component 510.

The entropy decoder 500 also recovers syntax elements indicating theprofile and level used to encode the bit stream. The decoder may thencompute an expected maximum tile rate (maximum number of tiles persecond) for pictures in the bit stream based on parameter values definedfor the level. Computation of the maximum tile rate is previouslydiscussed herein. The decoder may then use this maximum tile rate toverify that the tile rate for each picture is less than or equal to themaximum tile rate. In some embodiments, the decoder computes a maximumnumber of tiles for each picture based on the maximum tile rateconstraint and then compares the computed maximum number of tiles to thenumber of tiles indicated in a picture parameter set of a picture toverify that the number of tiles in the picture is than or equal to thecomputed maximum tile number. The decoder computes the maximum number oftiles for a picture (for a fixed frame rate or a variable frame rate) inthe same manner as the encoder. The decoder may take any suitable actionif the number of tiles indicated in a picture parameter set of a pictureexceeds the computed maximum number of tiles for the picture. Theparticular action taken by the decoder may depend on the applicationusing the decoder.

The inverse quantize component (10) 502 de-quantizes the quantizedtransform coefficients of the CUs. The inverse transform component 504transforms the frequency domain data from the inverse quantize component502 back to the residual CUs. That is, the inverse transform component504 applies an inverse unit transform, i.e., the inverse of the unittransform used for encoding, to the de-quantized residual coefficientsto produce reconstructed residual values of the CUs.

A residual CU supplies one input of the addition component 506. Theother input of the addition component 506 comes from the mode switch508. When an inter-prediction mode is signaled in the encoded videostream, the mode switch 508 selects predicted PUs from the motioncompensation component 510 and when an intra-prediction mode issignaled, the mode switch selects predicted PUs from theintra-prediction component 514.

The motion compensation component 510 receives reference data from thestorage component 512 and applies the motion compensation computed bythe encoder and transmitted in the encoded video bit stream to thereference data to generate a predicted PU. That is, the motioncompensation component 510 uses the motion vector(s) from the entropydecoder 500 and the reference data to generate a predicted PU.

The intra-prediction component 514 receives reconstructed samples frompreviously reconstructed PUs of a current picture from the storagecomponent 512 and performs the intra-prediction computed by the encoderas signaled by an intra-prediction mode transmitted in the encoded videobit stream using the reconstructed samples as needed to generate apredicted PU.

The addition component 506 generates a reconstructed CU by adding thepredicted PUs selected by the mode switch 508 and the residual CU. Theoutput of the addition component 506, i.e., the reconstructed CUs, isstored in the storage component 512 for use by the intra-predictioncomponent 514.

In-loop filters may be applied to reconstructed picture data to improvethe quality of the decoded pictures and the quality of the referencepicture data used for decoding of subsequent pictures. The appliedin-loop filters are the same as those of the encoder, i.e., a deblockingfilter 516, a sample adaptive offset filter (SAO) 518, and an adaptiveloop filter (ALF) 520. The in-loop filters may be applied on anLCU-by-LCU basis and the final filtered reference picture data isprovided to the storage component 512. In some embodiments, the ALFcomponent 520 is not present.

FIG. 6 is a flow diagram of a method for constraining tile processingoverhead during encoding of a video sequence that may be performed, forexample, by the encoder of FIGS. 4A and 4B. Initially, the level of thevideo sequence is determined 600. As previously discussed, an encoderknows the picture size, bit-rate, frame-rate requirements of theincoming video. The encoder may use this information to perform a tablelookup in a level table such as that of FIG. 2 to select the minimumlevel that satisfies the performance needs of the incoming video.

The maximum (worst case) tile rate for the level is then computed 602.Computation of the maximum tile rate for a level is previously describedherein. Then, the number of tiles in each picture of the video sequenceis constrained to be less than or equal to a maximum number of tilescomputed for each picture based on the maximum tile rate. Morespecifically, for each picture 610, a maximum number of tiles iscomputed 604 based on the maximum tile rate, and the picture is encoded606 according to the computed maximum number of tiles, i.e., during theencoding, the number of tiles in the picture is constrained to be lessthan or equal to the computed maximum number of tiles. Computation ofthe maximum number of tiles for a picture for either a fixed frame rateor a variable frame rate is previously described herein. After a pictureis encoded, information indicating the number of tiles, the tiles sized,and the tile locations in the picture is signaled 608 in the encoded bitstream in a picture parameter set for the picture.

Using the method of FIG. 6 , the worst case tile processing overheadremains constant for a level. Taking level 5 in the table of FIG. 2 asan example, the maximum number of tiles allowed in a picture is 110, 27,and 13 for 4k×2K@30, 1080p@120 and 720p@240, respectively, and the worstcase number of tiles per second is approximately constant for level 5,i.e., 3300 tiles/sec for 4k×2K@30, 3240 tiles/sec for 1080p@120, and2130 tiles/sec for 720p@240.

FIG. 7 is a flow diagram of method for verifying that tile processingoverhead is constrained to a maximum tile rate during decoding of acompressed video bit stream that may be performed, for example, by thedecoder of FIG. 5 . Initially, the level of the compressed bit stream isdetermined 700 by decoding an indication of the level from the bitstream. The maximum (worst case) tile rate for the level is thencomputed 702. Computation of the maximum tile rate for a level isperformed in the same manner as in the encoder and is previouslydescribed herein. Then, the number of tiles in each picture encoded inthe bit stream is determined from information in the picture parametersets of each picture and the number of tiles is verified against amaximum number of tiles computed for each picture based on the maximumtile rate. More specifically, for each picture 712, a maximum number oftiles is computed 704 based on the maximum tile rate and the number oftiles in the picture is determined 706 from the picture parameter set ofthe picture. Computation of the maximum number of tiles for a picturefor either a fixed frame rate or a variable frame rate is previouslydescribed herein.

If the number of tiles in the picture is less than or equal to 708 thecomputed maximum number of tiles, the picture is decoded 710, andprocessing continues with the next picture, if any 712, in thecompressed bit stream. Otherwise, the number of tiles in the pictureexceeds the maximum number. In such a case, any suitable processing maybe performed 709 to compensate for exceeding the maximum tile rate. Forexample, the decoding of a few tiles or pictures may be skipped to meetreal-time decoding requirements. Once the tile rate exceeded processingis complete, processing continues with the next picture, if any 712.

FIG. 9 is a block diagram of an example digital system suitable for useas an embedded system that may be configured to constrain the tile rateper picture during the encoding process to be less than or equal to aworst case number of tiles per second rate as described herein duringencoding of a video stream and/or to verify that the tile rates ofpictures are constrained to a maximum tile rate during decoding of anencoded video bit stream as described herein. This examplesystem-on-a-chip (SoC) is representative of one of a family of DaVinci™Digital Media Processors, available from Texas Instruments, Inc. ThisSoC is described in more detail in “TMS320DM6467 Digital MediaSystem-on-Chip”, SPRS403G, December 2007 or later, which is incorporatedby reference herein.

The SoC 900 is a programmable platform designed to meet the processingneeds of applications such as video encode/decode/transcode/transrate,video surveillance, video conferencing, set-top box, medical imaging,media server, gaming, digital signage, etc. The SoC 900 provides supportfor multiple operating systems, multiple user interfaces, and highprocessing performance through the flexibility of a fully integratedmixed processor solution. The device combines multiple processing coreswith shared memory for programmable video and audio processing with ahighly-integrated peripheral set on common integrated substrate.

The dual-core architecture of the SoC 900 provides benefits of both DSPand Reduced Instruction Set Computer (RISC) technologies, incorporatinga DSP core and an ARM926EJ-S core. The ARM926EJ-S is a 32-bit RISCprocessor core that performs 32-bit or 16-bit instructions and processes32-bit, 16-bit, or 8-bit data. The DSP core is a TMS320C64x+™ core witha very-long-instruction-word (VLIW) architecture. In general, the ARM isresponsible for configuration and control of the SoC 900, including theDSP Subsystem, the video data conversion engine (VDCE), and a majorityof the peripherals and external memories. The switched central resource(SCR) is an interconnect system that provides low-latency connectivitybetween master peripherals and slave peripherals. The SCR is thedecoding, routing, and arbitration logic that enables the connectionbetween multiple masters and slaves that are connected to it.

The SoC 900 also includes application-specific hardware logic, on-chipmemory, and additional on-chip peripherals. The peripheral set includes:a configurable video port (Video Port I/F), an Ethernet MAC (EMAC) witha Management Data Input/Output (MDIO) module, a 4-bit transfer/4-bitreceive VLYNQ interface, an inter-integrated circuit (I2C) businterface, multichannel audio serial ports (McASP), general-purposetimers, a watchdog timer, a configurable host port interface (HPI);general-purpose input/output (GPIO) with programmable interrupt/eventgeneration modes, multiplexed with other peripherals, UART interfaceswith modem interface signals, pulse width modulators (PWM), an ATAinterface, a peripheral component interface (PCI), and external memoryinterfaces (EMIFA, DDR2). The video port I/F is a receiver andtransmitter of video data with two input channels and two outputchannels that may be configured for standard definition television(SDTV) video data, high definition television (HDTV) video data, and rawvideo data capture.

As shown in FIG. 9 , the SoC 900 includes two high-definitionvideo/imaging coprocessors (HDVICP) and a video data conversion engine(VDCE) to offload many video and image processing tasks from the DSPcore. The VDCE supports video frame resizing, anti-aliasing, chrominancesignal format conversion, edge padding, color blending, etc. The HDVICPcoprocessors are designed to perform computational operations requiredfor video encoding such as motion estimation, motion compensation,intra-prediction, transformation, and quantization. Further, thedistinct circuitry in the HDVICP coprocessors that may be used forspecific computation operations is designed to operate in a pipelinefashion under the control of the ARM subsystem and/or the DSP subsystem.

As was previously mentioned, the SoC 900 may be configured to constrainthe tile rate per picture during the encoding process to be less than orequal to a worst case number of tiles per second rate as describedherein during encoding of a video stream and/or to verify that the tilerates of pictures are constrained to a maximum tile rate during decodingof an encoded video bit stream as described herein. For example, thecoding control of the video encoder of FIGS. 4A and 4B may be executedon the DSP subsystem or the ARM subsystem and at least some of thecomputational operations of the block processing, including theintra-prediction and inter-prediction of mode selection, transformation,quantization, and entropy encoding may be executed on the HDVICPcoprocessors. Similarly, at least some of the computational operationsof the various components of the video decoder of FIG. 5 , includingentropy decoding, inverse quantization, inverse transformation,intra-prediction, and motion compensation may be executed on the HDVICPcoprocessors.

OTHER EMBODIMENTS

While the invention has been described with respect to a limited numberof embodiments, those skilled in the art, having benefit of thisdisclosure, will appreciate that other embodiments can be devised whichdo not depart from the scope of the invention as disclosed herein.

For example, embodiments have been described herein in which the maximumnumber of tiles in a picture is computed as the minimum of the maximumnumber of tiles specified for a level and a number of tiles computedbased on the maximum tile rate. One of ordinary skill in the art willunderstand embodiments in which rather than setting the maximum numberof tiles for a picture as the minimum of the two tile counts, themaximum number of tiles per picture is set to the number of tilescomputed based on the maximum tile rate, i.e., to MaxTileRate/FrameRatefor fixed frame rate pictures and MaxTileRate*(t(n)−t(n−1) for variableframe rate pictures.

In another example, embodiments have been described herein in which themaximum number of tiles for a picture is dependent on the frame rate.One of ordinary skill in the art will understand embodiments in whichthe maximum number of tiles may be computed independent of the framerate given the luma picture size of a picture. In such embodiments, themaximum number of tiles for a picture may be computed as

MaxTileCols*MaxTileRows*PicSizeInSamplesY/MaxLumaPS

where MaxTileCols, MaxTileRows, and MaxLumaPS are previously definedherein. For a level, PicSizeInSamplesY may be determined as the productof the height and width of a luma picture and is always less than orequal to MaxLumaPS.

Embodiments of the methods, encoders, and decoders described herein maybe implemented in hardware, software, firmware, or any combinationthereof. If completely or partially implemented in software, thesoftware may be executed in one or more processors, such as amicroprocessor, application specific integrated circuit (ASIC), fieldprogrammable gate array (FPGA), or digital signal processor (DSP). Thesoftware instructions may be initially stored in a computer-readablemedium and loaded and executed in the processor. In some cases, thesoftware instructions may also be sold in a computer program product,which includes the computer-readable medium and packaging materials forthe computer-readable medium. In some cases, the software instructionsmay be distributed via removable computer readable media, via atransmission path from computer readable media on another digitalsystem, etc. Examples of computer-readable media include non-writablestorage media such as read-only memory devices, writable storage mediasuch as disks, flash memory, memory, or a combination thereof.

Although method steps may be presented and described herein in asequential fashion, one or more of the steps shown in the figures anddescribed herein may be performed concurrently, may be combined, and/ormay be performed in a different order than the order shown in thefigures and/or described herein. Accordingly, embodiments should not beconsidered limited to the specific ordering of steps shown in thefigures and/or described herein.

It is therefore contemplated that the appended claims will cover anysuch modifications of the embodiments as fall within the true scope ofthe invention.

1. A system comprising: a receiver configured to receive an encodedbitstream, wherein a first picture in a sequence of pictures is encodedin the encoded bitstream; and a processor coupled to the receiver,wherein the processor configured to decode the encoded bitstream suchthat a number of tiles in the first picture is less than or equal to aminimum value of a first value and a second value, wherein the firstvalue is based on a luma picture size of the first picture and furtherbased on a maximum luma picture size, and wherein the second value isbased on a maximum number of tile columns and further based on a maximumnumber of tile rows.
 2. The system of claim 1, further comprising adisplay coupled to the processor, wherein the display is configured todisplay the first picture.
 3. The system of claim 2, wherein the displaycomprises a light emitting diode display.
 4. The system of claim 2,wherein the display comprises a liquid crystal display.
 5. The system ofclaim 1, wherein the processor is configured to decode a level to whichthe sequence of pictures conforms, and wherein the level specifies themaximum number of tile columns.
 6. The system of claim 1, wherein theprocessor is configured to decode a level to which the sequence ofpictures conforms, and wherein the level specifies the maximum number oftile rows.
 7. The system of claim 1, wherein the processor is configuredto decode a level to which the sequence of pictures conforms, andwherein the level specifies the maximum luma picture size.
 8. The systemof claim 1, wherein the first value is further based on a coded picturebuffer removal time.
 9. The system of claim 8, wherein the first valueis further based on a difference between the coded picture bufferremoval time and a nominal coded picture buffer removal time.
 10. Thesystem of claim 1, wherein the first value is further based on themaximum number of tile columns.
 11. The system of claim 1, wherein thefirst value is further based on the maximum number of tile rows.
 12. Amethod comprising: receiving, by a receiver, an encoded bitstream,wherein a first picture in a sequence of pictures is encoded in theencoded bitstream; and decoding, by a processor coupled to the receiver,the encoded bitstream such that a number of tiles in the first pictureis less than or equal to than a minimum value of a first value and asecond value, wherein the first value is based on a luma picture size ofthe first picture and further based on a maximum luma picture size, andwherein the second value is based on a maximum number of tile columnsand further based on a maximum number of tile rows.
 13. The method ofclaim 12, further comprising displaying the first picture.
 14. Themethod of claim 13, wherein displaying the first picture is via a lightemitting diode display.
 15. The method of claim 13, wherein displayingthe first picture is via a liquid crystal display.
 16. The method ofclaim 12, wherein the processor is configured to decode a level to whichthe sequence of pictures conforms, and wherein the level specifies themaximum number of tile columns.
 17. The method of claim 12, wherein theprocessor is configured to decode a level to which the sequence ofpictures conforms, wherein the level specifies the maximum number oftile rows, and wherein the level specifies the maximum luma picturesize.
 18. The method of claim 12, wherein the first value is furtherbased on a coded picture buffer removal time.
 19. The method of claim18, wherein the first value is further based on a difference between thecoded picture buffer removal time and a nominal coded picture bufferremoval time.
 20. The method of claim 12, wherein the first value isfurther based on the maximum number of tile columns, and wherein thefirst value is further based on the maximum number of tile rows.